Dimensional Reductions for the Computation of Time–Dependent Quantum Expectations | SIAM Journal on Scientific Computing | Vol. 33, NO. 4 | Society for Industrial and Applied Mathematics

نویسندگان

  • GIACOMO MAZZI
  • BENEDICT J. LEIMKUHLER
چکیده

We consider dimension reduction techniques for the Liouville–von Neumann equation for the evaluation of the expectation values in a mixed quantum system. We describe several existing methods that have appeared in the literature, showing the failure of them when the system is scaled up. We introduce a new method termed direct expectation values via Chebyshev based on evaluation of a trace formula combined with a direct expansion in modified Chebyshev polynomials. This reduction is highly efficient and does not destroy any information. We demonstrate the practical application of the scheme for a nuclear spin system and compare with popular alternatives. In nuclear spin dynamics the main goal for simulations is being able to simulate a system with as many spins as possible; for this reason it is very important to have an efficient method that scales the least with respect to the number of particles. This method may be applied to autonomous quantum problems where the desired outcome of quantum simulation, rather than being a full description of the system, is only the expectation value of some observables.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Numerical Method for the Solution of the L2 Optimal Mass Transfer Problem

In this paper we present a new computationally efficient numerical scheme for the minimizing flow approach for the computation of the optimal L(2) mass transport mapping. In contrast to the integration of a time dependent partial differential equation proposed in [S. Angenent, S. Haker, and A. Tannenbaum, SIAM J. Math. Anal., 35 (2003), pp. 61-97], we employ in the present work a direct variati...

متن کامل

A Cartesian Grid Projection Method for the Incompressible Euler Equations in Complex Geometries | SIAM Journal on Scientific Computing | Vol. 18, No. 5 | Society for Industrial and Applied Mathematics

Many problems in fluid dynamics require the representation of complicated internal or external boundaries of the flow. Here we present a method for calculating time-dependent incompressible inviscid flow which combines a projection method with a “Cartesian grid” approach for representing geometry. In this approach, the body is represented as an interface embedded in a regular Cartesian mesh. Th...

متن کامل

Dimensional Reductions for the Computation of Time-Dependent Quantum Expectations

We consider dimension reduction techniques for the Liouville-von Neumann equation for the evaluation of the expectation values in a mixed quantum system. We describe several existing methods that have appeared in the literature, showing the failure of them when the system is scaled up. We introduce a new method termed DEC (Direct Expectation values via Chebyshev) based on evaluation of a trace ...

متن کامل

Multifidelity Information Fusion Algorithms for High-Dimensional Systems and Massive Data sets | SIAM Journal on Scientific Computing | Vol. 38, No. 4 | Society for Industrial and Applied Mathematics

We develop a framework for multifidelity information fusion and predictive inference in high-dimensional input spaces and in the presence of massive data sets. Hence, we tackle simultaneously the “big N” problem for big data and the curse of dimensionality in multivariate parametric problems. The proposed methodology establishes a new paradigm for constructing response surfaces of high-dimensio...

متن کامل

Asymptotic algorithm for computing the sample variance of interval data

The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011